Algebraic characterisation of one-way patterns
نویسندگان
چکیده
We give a complete structural characterisation of the map the positive branch of a one-way pattern implements. We start with the representation of the positive branch in terms of the phase map decomposition [4], which is then further analysed to obtain the primary structure of the matrix M, representing the phase map decomposition in the computational basis. Using this approach we obtain some preliminary results on the connection between the columns structure of a given unitary and the angles of measurements in a pattern that implements it. We believe this work is a step forward towards a full characterisation of those unitaries with an efficient one-way model implementation.
منابع مشابه
A characterisation of clique-width through nested partitions
Clique-width of graphs is defined algebraically through operations on graphs with vertex labels. We characterise the clique-width in a combinatorial way by means of partitions of the vertex set, using trees of nested partitions where partitions are ordered bottom-up by refinement. We show that the correspondences in both directions, between combinatorial partition trees and algebraic terms, pre...
متن کاملSemidefinite characterisation of invariant measures for one-dimensional discrete dynamical systems
Using recent results on measure theory and algebraic geometry, we show how semidefinite programming can be used to construct invariant measures of onedimensional discrete dynamical systems (iterated maps on a real interval). In particular we show that both discrete measures (corresponding to finite cycles) and continuous measures (corresponding to chaotic behavior) can be recovered using standa...
متن کاملA State-Based Characterisation of the Conflict Preorder
This paper proposes a way to effectively compare the potential of processes to cause conflict. In discrete event systems theory, two concurrent systems are said to be in conflict if they can get trapped in a situation where they are both waiting or running endlessly, forever unable to complete their common task. The conflict preorder is a process-algebraic pre-congruence that compares two proce...
متن کاملLabelled Transition Systems Bisimulation and Distributed Bisimulation Algebraic Characterisation of Distributed Bisimulation Weak Observations Weak Distributed Bisimulation Algebraic Characterisation of Weak Distributed Bisimulation Communication as Mutual Observation towards an Algebraic Characterisation of Weak Distributed Bisimulation with Communication Castellani
In this paper, I will describe and critically evaluate the paper Distributed Bisimulations, by Ilaria Castellani and Matthew Hennessy [5]. The aim of their paper is to generalise bisimulation equivalence for a subset of CCS to take into account the distributed nature of processes and, thus give a noninterleaving semantic theory which has many of the advantages of the interleaving theory. This t...
متن کاملExpressibility of Valued Constraints
In this paper we present a project on the expressibility of valued constraints. We recall the result of Cohen et al. [2] which characterises the expressibility of valued constraints in terms of algebraic properties of the constraints. We show why the current algebraic characterisation is rather unsatisfactory and what are the ways we try to explore in order to find a better one.
متن کامل